The procedure to construct a word predictor in a speech understanding system from a task-specific grammar defined in a CFG or a DCG
نویسندگان
چکیده
This paper describes a method for converting a task-dependent grammar into a word predictor of a speech understanding system, Since tile word prediction is a top-down operation, le f t recursive rules induces an i n f i n i t e looping. We have solved this problem by applying an algorithm for bottom-up parsing,
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملFrom Context-Free to Definite-Clause Grammars: A Type-Theoretic Approach
> We discuss the mechanical transformation of an unambiguous context-free grammar (CFG) into a deenite-clause grammar (DCG) using a nite set of examples, each of which is a pair hs; mi, where s is a sentence belonging to the language deened by the CFG and m is the semantic representation (meaning) of s. The resulting DCG would be such that it could be executed to compute the semantics for every...
متن کاملThe Intersection of Finite State Automata and Definite Clause Grammars
Bernard Lang defines parsing as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word string). Furthermore, certain techniques for robust parsing can be modelled as finite state transdu...
متن کاملارائه یک روش جدید بازیابی اطلاعات مناسب برای متون حاصل از بازشناسی گفتار
In this article a pre-processing method is introduced which is applicable in speech recognized texts retrieval task. We have a text corpus, t generated from a speech recognition system and a query as inputs, to search queries in these documents and find relevant documents. A basic problem in a typical speech recognized text is some error percentage in recognition. This, results erroneously ass...
متن کاملAutomatic Synthesis of Semantics for Context-free Grammars
We are investigating the mechanical transformation of an unambiguous context-free grammar (CFG) into a deenite-clause grammar (DCG) using a nite set of examples, each of which is a pair hs; mi, where s is a sentence belonging to the language deened by the CFG and m is a semantic representation (meaning) of s. The resulting DCG would be such that it can be executed (by the interpreter of a logic...
متن کامل